منابع مشابه
Towards a Theory of Randomized Search Heuristics
There is a well-developed theory about the algorithmic complexity of optimization problems. Complexity theory provides negative results which typically are based on assumptions like NP 6=P or NP 6=RP. Positive results are obtained by the design and analysis of clever algorithms. These algorithms are well-tuned for their specific domain. Practitioners, however, prefer simple algorithms which are...
متن کاملTheory of Randomized Optimization Heuristics
This report summarizes the talks, breakout sessions, and discussions at the Dagstuhl Seminar 17191 on Theory of Randomized Optimization Heuristics, held during the week from May 08 until May 12, 2017, in Schloss Dagstuhl – Leibniz Center for Informatics. The meeting is the successor of the “Theory of Evolutionary Algorithm” seminar series, where the change in the title reflects the development ...
متن کاملCombinatorial optimization and the analysis of randomized search heuristics
Randomized search heuristics have widely been applied to complex engineering problems as well as to problems from combinatorial optimization. We investigate the runtime behavior of randomized search heuristics and present runtime bounds for these heuristics on some well-known combinatorial optimization problems. Such analyses can help to understand better the working principle of these algorith...
متن کاملLearning Effective Search Heuristics
SAGE.2 is a production system that improves its search strategies with practice. The program incorporates four different heuristics for assigning credit and blame, and employs a discrimination process to direct its search through the space of move-proposing rules. The system has shown its generality by learning search heuristics in five different task domains. In addition to improving its searc...
متن کاملImproving Heuristics through Search
We investigate two methods of using limited search to improve admissible heuristics for planning, similar to pattern databases and pattern searches. We also develop a new algorithm for searching AND/OR graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2012
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-012-9686-7